#include<queue>
#include<vector>
#include<iostream>
using namespace std;

int a[9] = {1, 3, 5, 8, 10, 21, 33, 46, 57};
priority_queue<int, vector<int>, greater<int> > pq;

int main()
{
	for(auto ii:a)
		pq.push(ii);
	int x;
	cin >> x;
	pq.push(x);
	while(!pq.empty())
	{
		cout<<pq.top()<<" ";
		pq.pop();
	}
	return 0;
}
